Learning by Bidding
نویسنده
چکیده
We analyze a dynamic second-price auction with an informed bidder and an uninformed bidder who, upon seeing a posted price, learns whether his valuation is above that price. In the essentially unique equilibrium, an informed bidder bids in the rst period if her valuation is below some cuto¤ and bids only in the last period otherwise. An uninformed bidder bids in every period to optimally change the price unless the price is above his valuation or he is the high bidder. This model also provides a rationale behind the use of a secret reserve price in private-value settings.
منابع مشابه
Bidding Strategy on Demand Side Using Eligibility Traces Algorithm
Restructuring in the power industry is followed by splitting different parts and creating a competition between purchasing and selling sections. As a consequence, through an active participation in the energy market, the service provider companies and large consumers create a context for overcoming the problems resulted from lack of demand side participation in the market. The most prominent ch...
متن کاملBidding Strategy in Spot Markets with Definition of a New Market Power Index by Using Conjectural Variation
In this paper, the concept of Conjectural Variation (CV) is used to specify optimal generation decision for generation companies (Gencos). The conjecture of Genco is defined as its belief or expectation about the reaction of rivals to change of its output. Using CV method, each Genco has to learn and estimate strategic behaviors of other competitors from available historical market operation da...
متن کاملContract Bridge Bidding by Learning
Contract bridge is an example of an incomplete information game for which computers typically do not perform better than expert human bridge players. In particular, the typical bidding decisions of human bridge players are difficult to mimic with a computer program, and thus automatic bridge bidding remains to be a challenging research problem. Currently, the possibility of automatic bidding wi...
متن کاملReal-Time Bidding with Multi-Agent Reinforcement Learning in Display Advertising
Real-time advertising allows advertisers to bid for each impression for a visiting user. To optimize a specic goal such as maximizing the revenue led by ad placements, advertisers not only need to estimate the relevance between the ads and user’s interests, but most importantly require a strategic response with respect to other advertisers bidding in the market. In this paper, we formulate bid...
متن کاملEvaluation of Price-Sensitive Loads\' Impacts on LMP and Market Power using LMP Decomposition
This paper presents a novel approach for evaluating impacts of price-sensitive loads on electricity price and market power. To accomplish this aim an analytical method along with agent-based computational economics are used. At first, Nash equilibrium is achieved by computational approach of Q-learning then based on the optimal bidding strategies of GenCos, which are figured out by Q-learning, ...
متن کاملA Model for Bidding Markup Decisions Making based-on Agent Learning
Bidding is a very important business function to find latent contractors of construction projects. Moreover, bid markup is one of the most important decisions for a bidder to gain a reasonable profit. Since the bidding system is a complex adaptive system, bidding agent need a learning process to get more valuable knowledge for a bid, especially from past public bidding information. In this pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007